Zero-One Laws for Connectivity in Random Key Graphs
نویسندگان
چکیده
The random key graph is a random graph naturally associated with the random key predistribution scheme introduced by Eschenauer and Gligor in the context of wireless sensor networks. For this class of random graphs we establish a new version of a conjectured zero-one law for graph connectivity as the number of nodes becomes unboundedly large. The results reported here complement and strengthen recent work on this conjecture by Blackburn and Gerke. In particular, the results are given under conditions which are more realistic for applications to wireless sensor networks.
منابع مشابه
2 5 A ug 2 00 9 Zero - one laws for connectivity in random key graphs ∗
The random key graph is a random graph naturally associated with the random key predistribution scheme of Eschenauer and Gligor for wireless sensor networks. For this class of random graphs we establish a new version of a conjectured zero-one law for graph connectivity as the number of nodes becomes unboundedly large. The results reported here complement and strengthen recent work on this conje...
متن کاملk-Connectivity in Random Key Graphs With Unreliable Links
Random key graphs form a class of random intersec-tion graphs and are naturally induced by the random key predis-tribution scheme of Eschenauer and Gligor for securing wirelesssensor network (WSN) communications. Random key graphshave received much interest recently, owing in part to theirwide applicability in various domains including recommendersystems, social networks...
متن کاملLogical properties of random graphs from small addable classes
We establish zero-one laws and convergence laws for monadic secondorder logic (MSO) (and, a fortiori, first-order logic) on a number of interesting graph classes. In particular, we show that MSO obeys a zero-one law on the class of connected planar graphs, the class of connected graphs of tree-width at most k and the class of connected graphs excluding the k-clique as a minor. In each of these ...
متن کاملPerformance of the Eschenauer-Gligor key distribution scheme under an ON/OFF channel
We investigate the secure connectivity of wireless sensor networks under the random key distribution scheme of Eschenauer and Gligor. Unlike recent work which was carried out under the assumption of full visibility, here we assume a (simplified) communication model where unreliable wireless links are represented as on/off channels. We present conditions on how to scale the model parameters so t...
متن کاملRandom intersection graphs and their applications in security, wireless communication, and social networks
Random intersection graphs have received much interest and been used in diverse applications. They are naturally induced in modeling secure sensor networks under random key predistribution schemes, as well as in modeling the topologies of social networks including common-interest networks, collaboration networks, and actor networks. Simply put, a random intersection graph is constructed by assi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IEEE Trans. Information Theory
دوره 58 شماره
صفحات -
تاریخ انتشار 2012